Hamiltonian Cycles in Triangular Grids
نویسندگان
چکیده
We study the Hamiltonian Cycle problem in graphs induced by subsets of the vertices of the tiling of the plane with equilateral triangles. By analogy with grid graphs we call such graphs triangular grid graphs. Following the analogy, we define the class of solid triangular grid graphs. We prove that the Hamiltonian Cycle problem is NPcomplete for triangular grid graphs. We show that with the exception of the “Star of David”, a solid triangular grid graph without cut vertices is always Hamiltonian.
منابع مشابه
Enumerating Hamiltonian Cycles
A dynamic programming method for enumerating hamiltonian cycles in arbitrary graphs is presented. The method is applied to grid graphs, king’s graphs, triangular grids, and three-dimensional grid graphs, and results are obtained for larger cases than previously published. The approach can easily be modified to enumerate hamiltonian paths and other similar structures.
متن کاملHamiltonian Paths Through Two- and Three-Dimensional Grids
This paper addresses the existence of Hamiltonian paths and cycles in two-dimensional grids consisting of triangles or quadrilaterals, and three-dimensional grids consisting of tetrahedra or hexahedra. The paths and cycles may be constrained to pass from one element to the next through an edge, through a vertex, or be unconstrained and pass through either. It was previously known that an uncons...
متن کاملTwo New Classes of Hamiltonian Graphs
We prove that a triangular grid without local cuts is (almost) always Hamiltonian. This suggests an efficient scheme for rendering triangulated manifolds by graphics hardware. We also show that the Hamiltonian Cycle problem is NP-Complete for planar subcubic graphs of arbitrarily high girth. As a by-product we prove that there exist tri-Hamiltonian planar subcubic graphs of arbitrarily high gir...
متن کاملUnit-length embedding of cycles and paths on grid graphs
Although there are very algorithms for embedding graphs on unbounded grids, only few results on embedding or drawing graphs on restricted grids has been published. In this work, we consider the problem of embedding paths and cycles on grid graphs. We give the necessary and sufficient conditions for the existence of cycles of given length k and paths of given length k between two given vertices ...
متن کاملMathematics of a Tetrahedron Chain and the Hamiltonian Cycle Problem
In this article we consider the problem of finding Hamiltonian cycles on a tetrahedral mesh. A Hamiltonian cycle is a closed loop through a tetrahedral mesh that visits each tetrahedron exactly once. Using techniques of a novel discrete differential geometry of n-simplices, we could immediately obtain Hamiltonian cycles on a rhombic dodecahedronshaped tetrahedral mesh consisting of 24 tetrahedr...
متن کامل